Spectral norm and quantum speed-up
نویسندگان
چکیده
In theoretical quantum computer science, understanding where and how computational speed-ups occur while applying quantum properties is a primary goal. In this paper, we study such problem under the framework of Quantum Query Model and prove the significance of L1-norm in the simulation of a given quantum algorithm. This result is presented by upper-bounds for the quotient between optimal classical complexity and the complexity of the given quantum algorithm.
منابع مشابه
Cartesian decomposition of matrices and some norm inequalities
Let X be an n-square complex matrix with the Cartesian decomposition X = A + i B, where A and B are n times n Hermitian matrices. It is known that $Vert X Vert_p^2 leq 2(Vert A Vert_p^2 + Vert B Vert_p^2)$, where $p geq 2$ and $Vert . Vert_p$ is the Schatten p-norm. In this paper, this inequality and some of its improvements ...
متن کاملQuantum speed limit for non-Markovian dynamics.
We derive a Margolus-Levitin-type bound on the minimal evolution time of an arbitrarily driven open quantum system. We express this quantum speed limit time in terms of the operator norm of the nonunitary generator of the dynamics. We apply these results to the damped Jaynes-Cummings model and demonstrate that the corresponding bound is tight. We further show that non-Markovian effects can spee...
متن کاملThe Impact of the Spectral Filter Bandwidth on the Spectral Entanglement and Indistinguishability of Photon Pairs of SPDC Process
In this paper, we have investigated the dependence of the spectral entanglement and indistinguishability of photon pairs produced by the spontaneous parametric down-conversion (SPDC) procedure on the bandwidth of spectral filters used in the detection setup. The SPDC is a three-wave mixing process which occurs in a nonlinear crystal and generates entangled photon pairs and utilizes as one of th...
متن کاملQuantum Speed-up for Approximating Partition Functions
We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo Markov Chain method and use non-adaptive cooling schedules. The improvement in time complexity is twofold: a quadratic reduction with respect to the spectral gap of the underlying Markov chains and a quadratic reducti...
متن کاملA conservative Fourier pseudo-spectral method for the nonlinear Schrödinger equation
A Fourier pseudo-spectral method that conserves mass and energy is developed for a two-dimensional nonlinear Schrödinger equation. By establishing the equivalence between the semi-norm in the Fourier pseudo-spectral method and that in the finite difference method, we are able to extend the result in Ref. [56] to prove that the optimal rate of convergence of the new method is in the order of O(N...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016